A characterization of some graph classes using excluded minors

نویسنده

  • Janka Chlebíková
چکیده

In this article we present a structural characterization of graphs without K5 and the octahedron as a minor. We introduce semiplanar graphs as arbitrary sums of planar graphs, and give their characterization in terms of excluded minors. Some other excluded minor theorems for 3-connected minors are shown.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Operations which preserve path-width at most two

The number of excluded minors for the graphs with path-width at most two is too large. To give a practical characterization of the obstructions for path-width at most two, we introduce the concept reducibility. We describe some operations, which preserve path-width at most two, and reduce the excluded minors to smaller graphs. In this sense, there are ten graphs which are non-reducible and obst...

متن کامل

Partial tracks, characterizations and recognition of graphs with path-width at most two

Nancy G. Kinnersley and Michael A. Langston has determined [3] the excluded minors for the class of graphs with path-width at most two. Here we give a simpler presentation of their result. This also leads us to a new characterization, and a linear time recognition algorithm for graphs width path-width at most two. 1 History and introduction Based on the seminal work of Seymour and Robertson [4]...

متن کامل

Learning Minor Closed Graph Classes with Membership and Equivalence Queries

The paper considers the problem of learning classes of graphs closed under taking minors It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries The representation of the class is in terms of a set of minimal excluded minors obstruction set

متن کامل

Excluded-minor Characterization of Apex-outerplanar

The class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K4 and K2,3. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed. We provide the complete list of 57 excluded minors for this class.

متن کامل

On the Excluded Minors for the Matroids That Are Either Binary or Ternary

The classes of binary and ternary matroids are both relatively well understood as is their intersection, the class of regular matroids. This paper considers the union M of the classes of binary and ternary matroids. M is a minor-closed class and the focus of the paper is on determining its set of excluded minors. It is conjectured here that this set of excluded minors unique matroids that are o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Periodica Mathematica Hungarica

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2007